Automatic Symmetry Detection for Model Checking Using Computational Group Theory

نویسندگان

  • Alastair F. Donaldson
  • Alice Miller
چکیده

We present an automatic technique for the detection of structural symmetry in a model directly from its Promela specification. Our approach involves finding the static channel diagram of the model, a graphical representation of channel-based system communication; computing the group of symmetries of this diagram; and computing the largest possible subgroup of these symmetries which induce automorphisms of the underlying model. We describe a tool, SymmExtractor, which, for a given model and LTL property, uses our approach to find a group of symmetries of the model which preserve the property. This group can then be used for symmetry reduction during model checking using existing quotient-based methods. Unlike previous approaches, our method can detect arbitrary structural symmetries arising from the communication structure of the model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic techniques for detecting and exploiting symmetry in model checking

Model checking is an increasingly popular technique for the formal verification of concurrent systems. The application of model checking is limited due to the statespace explosion problem as the number of components represented by a model increases, the worst case size of the associated state-space grows exponentially. As such, models of realistic systems are often too large to feasibly check. ...

متن کامل

Symmetry Reductions inModel Checking

&bstract. The use of symmetry to alleviate state-explosion problems during model-checking has become a important research topic. This paper investigates several problems which are important to techniques exploiting symmetry. The most important of these problems is the orbit problem. We prove that the orbit problem is equivalent to an important problem in computational group theory which is at l...

متن کامل

A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness

Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...

متن کامل

A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker

Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence of states during search. We present TopSPIN, a fully automatic symmetry reduction package for the SPIN model checker. TopSPIN uses the GAP computational algebra system to effectively detect state space symmetry from the associat...

متن کامل

Symmetry Reduction Techniques for Explicit-State Model Checking

We present a survey of our recent work on symmetry reduction techniques for explicit-state model checking, addressing the problems of automatic symmetry detection before search, and efficient exploitation of symmetry during search. We describe TopSPIN, an implementation of our techniques for the SPIN model checker, and discuss a user study assessing the feasibility of our approach.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005